Subobject Transformation Systems
نویسندگان
چکیده
Subobject transformation systems (sts) are proposed as a novel formal framework for the analysis of derivations of transformation systems based on the algebraic, double-pushout (dpo) approach. They can be considered as a simplified variant of dpo rewriting, acting in the distributive lattice of subobjects of a given object of an adhesive category. This setting allows for a direct analysis of all possible notions of causality between any two productions without requiring an explicit match. In particular several equivalent characterizations of independence of productions are proposed, as well as a local Church-Rosser theorem in the setting of sts. Finally, we show how any derivation tree in an ordinary dpo grammar leads to an sts via a process-like construction and show that relational reasoning in the resulting sts is sound and complete with respect to the independence in the original derivation tree.
منابع مشابه
Permutation Equivalence of DPO Derivations with Negative Application Conditions based on Subobject Transformation Systems
Switch equivalence for transformation systems has been successfully used in many domains for the analysis of concurrent behaviour. When using graph transformation as modelling framework for these systems, the concept of negative application conditions (NACs) is widely used – in particular for the specification of operational semantics. In this paper we show that switch equivalence can be improv...
متن کاملForschungsberichte der Fakultät IV – Elektrotechnik und Informatik Permutation Equivalence of DPO Derivations with Negative Application Conditions based on Subobject Transformation Systems (Long Version)
Switch equivalence for transformation systems has been successfully used in many domains for the analysis of concurrent behaviour. When using graph transformation as modelling framework for these systems, the concept of negative application conditions (NACs) is widely used – in particular for the specification of operational semantics. In this paper we show that switch equivalence can be improv...
متن کاملThe Subobject Classier of the Category of Functional Bisimulations
We show the existence of subobject classi er in the category of nondeterministic dynamical systems and functional bisimulations.
متن کاملAnalysis of permutation equivalence in -adhesive transformation systems with negative application conditions
M-adhesive categories provide an abstract framework for a large variety of specification frameworks for modelling distributed and concurrent systems. They extend the well-known frameworks of adhesive and weak adhesive HLR categories and integrate high-level constructs like attribution as in the case of typed attributed graphs. This article presents M-adhesive transformation systems including ne...
متن کاملModeling Subobject-based Inheritance
A model of subobjects and subobject selection gives us a concise expression of key semantic relationships in a variety of inheritance-based languages. Subobjects and their selection have been diicult to reason about explicitly because they are not explicit in the languages that support them. The goal of this paper is to present a relatively simple calculus to describe subobjects and subobject s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Categorical Structures
دوره 16 شماره
صفحات -
تاریخ انتشار 2008